Deterministic communication complexity of set intersection
نویسندگان
چکیده
منابع مشابه
Communication complexity of inevitable intersection
Many known methods for analysing the communication complexity of unstructured search are based on the hardness of the set disjointness problem. Such techniques may “hide” important aspects of the original problem. Intuitively, search is a much simpler task: while set disjointness is hard even for NP, successful search necessarily results in a short witness, which makes it easy for NP. According...
متن کاملMutual Private Set Intersection with Linear Complexity
A private set intersection (PSI) protocol allows players to obtain the intersection of their inputs. While in its unilateral version only the client can obtain the intersection, the mutual PSI protocol enables all players to get the desired result. In this work, we construct a mutual PSI protocol that is significantly more efficient than the stateof-the-art in the computation overhead. To the b...
متن کاملNon-Deterministic Communication Complexity of Regular Languages
The notion of communication complexity was introduced by Yao in his seminal paper [Yao79]. In [BFS86], Babai Frankl and Simon developed a rich structure of communication complexity classes to understand the relationships between various models of communication complexity. This made it apparent that communication complexity was a self-contained mini-world within complexity theory. In this thesis...
متن کاملStill Another Rank Determination of Set Intersection Matrices with an Application in Communication Complexity
The set-intersection function gives the cardinality of the intersection of two sets. In order to obtain a lower bound for the communication complexity of this function, the rank of the corresponding characteristic function-value matrices was calculated in 4] and 5]. In this note, the rank of these matrices is determined by another method of proof, which makes use of a factorization into a produ...
متن کاملNon-Deterministic Communication Complexity with Few Witnesses
We study non-deterministic communication protocols in which no input has too many witnesses. De ne nk(f) to be the minimum complexity of a non-deterministic protocol for the function f in which each input has at most k witnesses. We present two di erent lower bounds for nk(f). Our rst result shows that nk(f) is bounded below by (qc(f)=k) where c(f) is the deterministic complexity. Our second re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1995
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00021-5